For statistical inference of means of stationary processes, one needs toestimate their time-average variance constants (TAVC) or long-run variances.For a stationary process, its TAVC is the sum of all its covariances and it isa multiple of the spectral density at zero. The classical TAVC estimate whichis based on batched means does not allow recursive updates and the requiredmemory complexity is O(n). We propose a faster algorithm which recursivelycomputes the TAVC, thus having memory complexity of order O(1) and thecomputational complexity scales linearly in $n$. Under short-range dependenceconditions, we establish moment and almost sure convergence of the recursiveTAVC estimate. Convergence rates are also obtained.
展开▼
机译:为了对平稳过程的均值进行统计推断,需要估算其时均方差常数(TAVC)或长期方差。对于平稳过程,其TAVC是其所有协方差的总和,并且是频谱密度的倍数零。基于分批方式的经典TAVC估计不允许递归更新,并且所需的内存复杂度为O(n)。我们提出了一种更快的算法,该算法递归地计算TAVC,因此具有的存储复杂度为O(1),并且计算复杂度线性地扩展为$ n $。在短程依赖条件下,我们建立递归TAVC估计的矩并几乎确定收敛。还可以获得收敛速度。
展开▼